A minimum degree condition forcing complete graph immersion
نویسندگان
چکیده
منابع مشابه
Minimum degree condition forcing complete graph immersion
An immersion of a graph H into a graph G is a one-to-one mapping f : V (H) → V (G) and a collection of edge-disjoint paths in G, one for each edge of H , such that the path Puv corresponding to edge uv has endpoints f(u) and f(v). The immersion is strong if the paths Puv are internally disjoint from f(V (H)). It is proved that for every positive integer t, every simple graph of minimum degree a...
متن کاملGraph Minors and Minimum Degree
Let Dk be the class of graphs for which every minor has minimum degree at most k. Then Dk is closed under taking minors. By the Robertson-Seymour graph minor theorem, Dk is characterised by a finite family of minor-minimal forbidden graphs, which we denote by D̂k. This paper discusses D̂k and related topics. We obtain four main results: 1. We prove that every (k + 1)-regular graph with less than ...
متن کاملDirac's minimum degree condition restricted to claws
Let G be a graph on n t> 3 vertices. Dirac's minimum degree condition is the condition that all vertices of G have degree at least in. This is a well-known sufficient condition for the existence of a Hamilton cycle in G. We give related sufficiency conditions for the existence of a Hamilton cycle or a perfect matching involving a restriction of Dirac's minimum degree condition to certain subset...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملMinimum degree threshold for bipartite graph tiling
We answer a question of Zhao [SIAM J. Disc. Math. 23 vol.2, (2009), 888-900] that determines the minimum degree threshold for a bipartite graph G to contain an H-factor (a perfect tiling of G with H) for any bipartite graph H. We also show that this threshold is best possible up to a constant depending only on H. This result can be viewed as an analog to Kuhn and Osthus' result [Combinatorica 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2014
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-014-2806-z